Fuego - An Open-Source Framework for Board Games and Go Engine Based on Monte Carlo Tree Search

نویسندگان

  • Markus Enzenberger
  • Martin Müller
  • Broderick Arneson
  • R. Segal
چکیده

FUEGO is both an open-source software framework and a state of the art program that plays the game of Go. The framework supports developing game engines for fullinformation two-player board games, and is used successfully in a substantial number of projects. The FUEGO Go program became the first program to win a game against a top professional player in 9×9 Go. It has won a number of strong tournaments against other programs, and is competitive for 19× 19 as well. This paper gives an overview of the development and current state of the FUEGO project. It describes the reusable components of the software framework and specific algorithms used in the Go engine.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

BTT-Go: An Agent for Go that Uses a Transposition Table to Reduce the Simulations and the Supervision in the Monte-Carlo Tree Search

This paper presents BTT-Go: an agent for Go whose architecture is based on the well-known agent Fuego, that is, its search process for the best move is based on simulations of games performed by means of MonteCarlo Tree Search (MCTS). In Fuego, these simulations are guided by supervised heuristics called prior knowledge and play-out policy. In this context, the goal behind the BTT-Go proposal i...

متن کامل

Integrating Factorization Ranked Features in MCTS: an Experimental Study

Recently, Factorization Bradley-Terry (FBT) model is introduced for fast move prediction in the game of Go. It has been shown that FBT outperforms the state-of-the-art fast move prediction system of Latent Factor Ranking (LFR). In this paper, we investigate the problem of integrating feature knowledge learned by FBT model in Monte Carlo Tree Search. We use the open source Go program Fuego as th...

متن کامل

Cross-Entropy for Monte-Carlo Tree Search

Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs. To improve the playing strength of these Go programs any further, many parameters dealing with MCTS should be fine-tuned. In this paper, we propose to apply the Cross-Entropy Method (CEM) for this task. The method is ...

متن کامل

Go-Ahead: Improving Prior Knowledge Heuristics by Using Information Retrieved From Play Out Simulations

The proposal behind this paper is the introduction of a new agent denominated Go-Ahead: this is an automatic Go player that uses a new technique in order to improve the accuracy of the pre estimated values of the moves that are candidates to be introduced into the classical Monte Carlo tree search (MCTS) algorithm which is used by many of the current top agents for Go. Go-Ahead is built upon th...

متن کامل

A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm

With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the search has become an important issue. We present a new lock-free parallel algorithm for Monte-Carlo tree search which takes advantage of the memory model of the IA-32 and Intel-64 CPU architectures and intentionally ignore...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Comput. Intellig. and AI in Games

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2010